On the unique representability of spikes over prime fields
نویسندگان
چکیده
For an integer n ≥ 3, a rank-n matroid is called an n-spike if it consists of n three-point lines through a common point such that, for all k ∈ {1, 2, . . . , n− 1}, the union of every set of k of these lines has rank k + 1. Spikes are very special and important in matroid theory. Wu [13] found the exact numbers of n-spikes over fields with 2, 3, 4, 5, 7 elements, and the asymptotic values for larger finite fields. In this paper, we prove that, for each prime number p, a GF (p) representable n-spike M is only representable on fields with characteristic p provided that n ≥ 2p− 1. Moreover, M is uniquely representable over GF (p).
منابع مشابه
2 8 Ju n 20 06 Discrete Math . , in press . On the unique representability of spikes over prime fields
For an integer n ≥ 3, a rank-n matroid is called an n-spike if it consists of n three-point lines through a common point such that, for all k ∈ {1, 2, . . . , n− 1}, the union of every set of k of these lines has rank k + 1. Spikes are very special and important in matroid theory. Wu [13] found the exact numbers of n-spikes over fields with 2, 3, 4, 5, 7 elements, and the asymptotic values for ...
متن کاملStructure of finite wavelet frames over prime fields
This article presents a systematic study for structure of finite wavelet frames over prime fields. Let $p$ be a positive prime integer and $mathbb{W}_p$ be the finite wavelet group over the prime field $mathbb{Z}_p$. We study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{W}_p$.
متن کاملCertifying non-representability of matroids over prime fields
It is proved that, for a prime number p, showing that an n-element matroid is not representable over GF (p) requires only O(n) rank evaluations.
متن کاملAn excluded minors method for infinite matroids
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a finite field k if and only if all its finite minors are representable over k. We expect that the method we use to prove this will make it possible to lift m...
متن کاملUnique Prime Cartesian Factorization of Graphs over Finite Fields
A fundamental result, due to Sabidussi and Vizing, states that every connected graph has a unique prime factorization relative to the Cartesian product; but disconnected graphs are not uniquely prime factorable. This paper describes a system of modular arithmetic on graphs under which both connected and disconnected graphs have unique prime Cartesian factorizations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006